Exact Algorithm to Solve the Minimum Cost Multi-Constrained Multicast Routing Problem
نویسندگان
چکیده
منابع مشابه
Exact Algorithm to Solve the Minimum Cost Multi-Constrained Multicast Routing Problem
The optimal solution of the multi-constrained QoS multicast routing problem is a tree-like hierarchical structure in the topology graph. This multicast route contains a feasible path from the source node to each of the destinations with respect to a set of QoS constraints while minimizing a cost function. Often, it is a tree. In other cases, the hierarchies can return several times to nodes and...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملAdvanced Bounded Shortest Multicast Algorithm for Delay Constrained Minimum Cost
The Bounded Shortest Multicast Algorithm (BSMA) is a very well-known one of delay-constrained minimum-cost multicast routing algorithms. Although the algorithm shows excellent performance in terms of generated tree cost, it suffers from high time complexity. For this reason, there is much literature relating to the BSMA. In this paper, the BSMA is analyzed. The algorithms and shortcomings are c...
متن کاملThe cost optimal solution of the multi-constrained multicast routing problem
In this paper, we study the cost optimal solution of the well-known multi-constrained multicast routing problem. This problem consists in finding a multicast structure that spans a source node and a set of destination nodes with respect to a set of constraints. This optimization problem is particularly interesting for the multicast network communications that require Quality of Service (QoS) gu...
متن کاملMinimum-Cost Multicast Routing for Multi-Layered Multimedia Distribution
In this paper, we attempt to solve the problem of min-cost multicast routing for multi-layered multimedia distribution. More specifically, for (i) a given network topology (ii) the destinations of a multicast group and (iii) the bandwidth requirement of each destination, we attempt to find a feasible routing solution to minimize the cost of a multicast tree for multi-layered multimedia distribu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and Communications
سال: 2016
ISSN: 2327-5219,2327-5227
DOI: 10.4236/jcc.2016.414005